A new range-reduction algorithm
نویسندگان
چکیده
منابع مشابه
a new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA New Sidelobe Reduction Technique For Range Resolution Radar
In radar and communication applications not only low time sidelobes but also uniform sidelobes are important. Polyphase codes have low sidelobes and are more Doppler tolerant, but correlated sidelobes are not uniform. New filters are modeled in this paper for polyphase codes to reduce the sidelobes and also to generate uniform sidelobes. Uniform sidelobe pattern is useful for detection of weak ...
متن کاملA new range query algorithm for Universal B-trees
In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional dat...
متن کاملA New Algorithm for Learning Range Restricted Horn Expressions
A learning algorithm for the class of range restricted Horn expressions is presented and proved correct. The algorithm works within the framework of learning from entailment, where the goal is to exactly identify some pre-fixed and unknown expression by making questions to membership and equivalence oracles. This class has been shown to be learnable in previous work. The main contribution of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2005
ISSN: 0018-9340
DOI: 10.1109/tc.2005.36